UCPOP : A Sound , Complete , Partial Order Planner for ADLJ
نویسنده
چکیده
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional eeects, universally quan-tiied preconditions and eeects, and with universally quantiied goals. We prove ucpop is both sound and complete for this representation and describe a practical implementation that succeeds on all of Pednault's and McDermott's examples, including the infamous \Yale Stacking Problem" McDermott 1991].
منابع مشابه
UCPOP: A Sound, Complete, Partial Order Planner for ADL
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional e ects, universally quanti ed preconditions and e ects, and with universally quanti ed goals. We prove ucpop is both sound and complete for this representation and describe a practical implementation that succeeds...
متن کاملPartial Plans Completion with GRAPHPLAN
Completion of partial plans is a subtask for many planning techniques such as plan reusing, replanning and accomplishing complex user goals. The new generation of fast planners such as Graphplan, Satplan and others, is characterized by very efficent planning algorithms which exploit techniques of multiple plans representation. Unfortunately it is fairly difficult to give Graphplan a partial pla...
متن کاملMulti-Strategy Learning of Search Control for Partial-Order Planning
Most research in planning and learning has involved linear, state-based planners. This paper presents Scope, a system for learning search-control rules that improve the performance of a partial-order planner. Scope integrates explanation-based and inductive learning techniques to acquire control rules for a partial-order planner. Learned rules are in the form of selection heuristics that help t...
متن کاملStart Finish
Many real-world planning problems require generating plans that maximize the parallelism inherent in a problem. There are a number of partial-order planners that generate such plans; however, in most of these planners it is unclear under what conditions the resulting plans will be correct and whether the planner can even nd a plan if one exists. This paper identiies the underlying assumptions a...
متن کاملGenerating Parallel Execution Plans with a Partial-order Planner
Many real-world planning problems require generating plans that maximize the parallelism inherent in a problem. There are a number of partial-order planners that generate such plans; however, in most of these planners it is unclear under what conditions the resulting plans will be correct and whether the plaltner can even find a plan if one exists. This paper identifies the underlying assumptio...
متن کامل